Extensible User-Based XML Grammar Matching

نویسندگان

  • Joe Tekli
  • Richard Chbeir
  • Kokou Yétongnon
چکیده

XML grammar matching has found considerable interest recently due to the growing number of heterogeneous XML documents on the web and the increasing need to integrate, and consequently search and retrieve XML data originated from different data sources. In this paper, we provide an approach for automatic XML grammar matching and comparison aiming to minimize the amount of user effort required to perform the match task. We propose an open framework based on the concept of tree edit distance, integrating different matching criterions so as to capture XML grammar element semantic and syntactic similarities, cardinality and alternativeness constraints, as well as data-type correspondences and relative ordering. It is flexible, enabling the user to chose mapping cardinality (1:1, 1:n, n:1, n:n), in comparison with existing static methods (constrained to 1:1), and considers user feedback to adjust matching results to the user’s perception of correct matches. Conducted experiments demonstrate the efficiency of our approach, in comparison with alternative methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

XMLSpaces.NET: An Extensible Tuplespace as XML Middleware

XMLSpaces.NET implements the Linda concept as a middleware for XML documents on the .NET platform. It introduces an extended matching flexibility on nested tuples and richer data types for fields, including objects and XML documents. It is completely XML-based since data, tuples and tuplespaces are seen as trees represented as XML documents. XMLSpaces.NET is extensible in that it supports a hie...

متن کامل

Compact XML grammar based compression

Extensible Markup Language (XML) is the standard format for content representation and sharing on the Web. XML is a highly verbose language, especially regarding the duplication of meta-data in the form of elements and attributes. As XML content is becoming more widespread so is the demand to compress XML data volume. This paper presents a new grammar, called D-grammar, which defines XML struct...

متن کامل

Prospects of encoding Java source code in XML

Currently, the only standard format for representing Java source code is plain text-based. This paper explores the prospects of using Extensible Markup Language (XML) for this purpose. XML enables the leverage of tools and standards more powerful than those available for plain-text formats, while retaining broad accessibility. The paper outlines the potential benefits of future XML grammars tha...

متن کامل

XFIS: an XML filtering system based on string representation and matching

Information-filtering systems constitute a critical component of modern information-seeking applications. As the number of users grows and the amount of information available becomes even bigger, it is imperative to employ scalable and efficient representation and filtering techniques. Typically, the use of eXtensible Markup Language (XML) representation entails profile representation with the ...

متن کامل

XGA – XML Grammar for JAVA

Today’s XML editors provide basic functionality such as creating, editing and parsing documents and only a little information about a given XML element at runtime. Sometimes the user wants to know what valid element can be added without looking in to the DTD or validating the whole document. This paper presents a tool that solves that problem and was designed to be a link between DTD and XML Ed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009